- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources3
- Resource Type
-
0000100002000000
- More
- Availability
-
30
- Author / Contributor
- Filter by Author / Creator
-
-
Ballantine, Cristina (3)
-
Folsom, Amanda (3)
-
Wen, Boya (3)
-
Burson, Hannah (2)
-
Craig, William (2)
-
Burson, Hannah E. (1)
-
Hsu, Chi-Yun (1)
-
Negrini, Isabella (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
& Adams, S.G. (0)
-
& Ahmed, K. (0)
-
& Ahmed, Khadija. (0)
-
& Aina, D.K. Jr. (0)
-
& Akcil-Okan, O. (0)
-
& Akuom, D. (0)
-
& Aleven, V. (0)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Ballantine, Cristina; Burson, Hannah; Craig, William; Folsom, Amanda; Wen, Boya (, Séminaire lotharingien de combinatoire)Séminaire Lotharingien de Combinatoire - FPSAC 2023; Proceedings of the 35th International Conference on "Formal Power Series and Algebraic Combinatorics", July 17 - 21, 2023, University of California at Davis, USA; Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length 2, respectively 3, in all odd partitions of n than in all distinct partitions of n, and make the analogous conjecture for arbitrary hook length t ≥ 2. To this end, we establish very general linear inequalities for the number of distinct partitions, which is also of independent interest. We also establish additional related partition bias results.more » « less
-
Ballantine, Cristina; Burson, Hannah; Folsom, Amanda; Hsu, Chi-Yun; Negrini, Isabella; Wen, Boya (, Discrete mathematics)
An official website of the United States government

Full Text Available